Experimentation and Proof in Mathematics

نویسندگان

  • David Epstein
  • Silvio Levy
چکیده

670 NOTICES OF THE AMS VOLUME 42, NUMBER 6 T he English word “prove”—as its Old French and Latin ancestors—has two basic meanings: to try or test, and to establish beyond doubt. The first meaning is largely archaic, though it survives in technical expressions (printer’s proofs) and adages (the exception proves the rule, the proof of the pudding). That these two meanings could have coexisted for so long may seem strange to us mathematicians today, accustomed as we are to thinking of “proof” as an unambiguous term. But it is in fact quite natural, because the most common way to establish something in everyday life is to examine it, test it, probe it, experiment with it. As it turns out, much the same is true in mathematics as well. Most mathematicians spend a lot of time thinking about and analyzing particular examples. This motivates future development of theory and gives one a deeper understanding of existing theory. Gauss declared, and his notebooks attest to it, that his way of arriving at mathematical truths was “through systematic experimentation”. It is probably the case that most significant advances in mathematics have arisen from experimentation with examples. For instance, Prove: to try or test or to establish beyond doubt the theory of dynamical systems arose from observations made on the stars and planets and, more generally, from the study of physically motivated differential equations. A nice modern example is the discovery of the tree structure of certain Julia sets by Douady and Hubbard: this was first observed by looking at pictures produced by computers and was then proved by formal arguments. It is disturbing that such considerations are usually totally excluded from the published record. What one generally gets in print is a daunting logical cliff that only an experienced mountaineer might attempt to scale, and even then only with special equipment. Is this the best thing for the research community? Is it fair to graduate students? Should we give the impression that the best mathematics is some sort of magic conjured out of thin air by extraordinary people when it is actually the result of hard work and of intuition built on the study of many special cases? In our educational institutions, we spend too much time revealing these almost unscalable logical edifices instead of giving others

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei

In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...

متن کامل

Another proof of Banaschewski's surjection theorem

We present a new proof of Banaschewski's theorem stating that the completion lift of a uniform surjection is a surjection. The new procedure allows to extend the fact (and, similarly, the related theorem on closed uniform sublocales of complete uniform frames) to quasi-uniformities ("not necessarily symmetric uniformities"). Further, we show how a (regular) Cauchy point on a closed uniform subl...

متن کامل

Exploratory Experimentation: Digitally-Assisted Discovery and Proof

I believe that the mathematical community (appropriately defined) is facing a great challenge to re-evaluate the role of proof in light of the power of current computer systems, of modern mathematical computing packages and of the growing capacity to data-mine on the internet. Add to that the enormous complexity of many modern mathematical results such as the Poincaré conjecture, Fermat’s last ...

متن کامل

A SHORT PROOF OF A RESULT OF NAGEL

Let $(R,fm)$ be a Gorenstein local ring and$M,N$ be two finitely generated modules over $R$. Nagel proved that if $M$ and $N$ are inthe same even liaison class, thenone has $H^i_{fm}(M)cong H^i_{fm}(N)$ for all $iIn this paper, we provide a short proof to this result.

متن کامل

A necessary condition for multiple objective fractional programming

In this paper, we establish a proof for  a  necessary condition for  multiple objective fractional programming. In order to derive the set of necessary conditions, we employ an equivalent parametric problem. Also, we  present the related semi parametric model.

متن کامل

Partial proof of Graham Higman's conjecture related to coset diagrams

Graham Higman has defined coset diagrams for PSL(2,ℤ). These diagrams are composed of fragments, and the fragments are further composed of two or more circuits. Q. Mushtaq has proved in 1983 that existence of a certain fragment γ of a coset diagram in a coset diagram is a polynomial f in ℤ[z]. Higman has conjectured that, the polynomials related to the fragments are monic and for a fixed degree...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997